total graph
英 [ˈtəʊtl ɡræf]
美 [ˈtoʊtl ɡræf]
网络 全图
双语例句
- On the Equitable Total Coloring of the Join Graph of Fan and Complete Balanced 2-partite Graph
关于扇和完全等二部图联图的均匀全色数 - A note of the adjacent vertex-distinguishing total chromatic number of k-cube graph;
k-方体图邻点可区别全色数（英文） - Adjacent vertex distinguishing total coloring on 2-connected outer plane graph
2-连通外平面图的邻点可区别全染色 - Enter the total range of the graph. The height of each bar will be relative to this value.
输入图形的整体范围。该值将与各个条形的高度相对应。 - Adjacent Vertex-Distinguishing Total Coloring of One Class Graph about k_4-e
与k4-e有关的一类图的邻点可区别全染色 - The minimum number of colors required for an adjacent vertex-distinguishing total coloring of a simple graph G is called the adjacent vertex-distinguishing total chromatic number, denoted by xat ( G).
若一个正常全染色其相邻顶点的色集不同时，就称之为邻点可区别全染色，邻点可区别全染色所用颜色的最小数称为邻点可区别全色数。 - On the Equitable Total Chromatic Number of Mycielski Graph of Circle Graph
圈的Mycielski图的均匀全染色 - On the Total-Colourable Critical Graph
全着色临界图 - On the Total Binding Number of A Graph
关于图的全联结数 - Recently, some people presented the concept of adjacent vertex-distinguishing total coloring of graph.
图的邻点可区别全染色是最近提出的新概念。 - The Nodes Sequence Minimized Total Recycle Weight in Weighted Directed Graph
带权有向图总回流权最小的节点序列 - On the Relation of Total Independence Numbers of a Graph and Its Complementary Graph
图与补图全独立数间的关系 - The minus total domination number of graph
图的全负控制数 - Total Coloring of 3-Regular Graph
3正则图的全着色 - Adjacent Vertex Distinguishing Total Coloring on the Flower Graph
花图F（r.m.n）的邻点可区别全染色 - In this paper, the vertex strong total chromatic of K_4-minor free graph and outerplanar graph are studied.
本文研究了K4-minorfree图和外平面图的点强全色数。 - Total Hobbing Graph Drawn by Computer
计算机绘制完全滚齿图形 - Going For a Picnic Total Variation Image Denoising Algorithm Based on Graph Cut
一种基于图割的全变差图像去噪算法 - In this paper, a generalized algorithm is provided to extend a 4-regular graph to another 4-regular graph through base rectilinear extension, from which the base rectilinear extension with the minimum total number of bends of the graph is naturally obtained on the basis of the original one.
本文通过基纵横扩张，提供了从一个4-正则图扩充为另一个4-正则图的方式，使得从原图的最小折数基纵横扩张自然导出扩充图的最小折数基纵横扩张。 - The accomplished monitor modules include total graph of the device, columnar chart, time-frequency graph, axis trail graph and tendency graph, etc.
系统实现了部分常用的监测模块，包括设备总框图、柱状图、时域频域图、轴心轨迹图、趋势线和滤波、细化操作等模块。 - On the △+ 2 Total Colouring of a Graph
一类图的△+2全着色 - The edge chromatic number and equitable total chromatic number of join graph of star and complete bipartite graph is obtained in this paper.
本文得到了m+1阶星和完全等二部图联图的边色数和均匀全色数。 - Adjacent Vertex Distinguishing Total Coloring on the Product Graph P_2 × C_6
积图P2×C6的邻点可区别全染色 - Estimations for the domination number and total domination number of a graph
图的控制数及全控制数的估计 - A new upper bound for the total domination number of a graph
图的全本征数的一个新上界 - The paper gives a convenient and fast algorithm to find total spanning trees of a connected graph by the supplemented incidence matrix of the graph.
利用连通图的增广关联矩阵，给出了求连通图的全部互异的生成树的一种简单、快捷的算法。 - The total colouring of a graph G is to colour both the vertices and the edges of G.
图G的全着色是同时对G的点和边进行着色，G的正常全着色是使得V（G）∪E（G）中相邻或相关联的元素均染不同颜色的全着色。 - On the Strong Perfectness of Total Graph
关于全图的强完美性 - On the Total Harmonious Chromatic Number of a Graph
图的全谐调着色数 - In this paper, we prove that the book Bn is a super edge-magic total labeling graph while a is even ( n ≥ 6).
本文证明了当n为大于等于6的偶数时，Bn是超边幻和图。